Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö (KIISE Transactions on Computing Practices)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
¹®¹ýÀû Áøȱâ¹ý°ú Á¶°ÇºÎ È®·üÀ» ÀÌ¿ëÇÑ Ã»¼Ò ·Îº¿ÀÇ À̵¿ ÆÐÅÏ °èȹ |
¿µ¹®Á¦¸ñ(English Title) |
Designing the Moving Pattern of Cleaning Robot based on Grammatical Evolution with Conditional Probability Table |
ÀúÀÚ(Author) |
±Ç¼øÁ¶
±èÇöÅÂ
¾Èâ¿í
Soon-Joe Gwon
Hyun-Tae Kim
Chang Wook Ahn
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 22 NO. 04 PP. 0184 ~ 0188 (2016. 04) |
Çѱ۳»¿ë (Korean Abstract) |
û¼Ò ·Îº¿Àº °¡Á¤¿¡¼ »ç¿ë °¡´ÉÇÑ ´ëÇ¥ÀûÀÎ Áö´ÉÇü ·Îº¿ÀÌ´Ù. °í°¡Çü û¼Ò ·Îº¿Àº ¼¾¼·ÎºÎÅÍ Á¤º¸¸¦ Á¦°ø¹Þ¾Æ ³ôÀº Ä¿¹ö¸®Áö ¼º´ÉÀ» °¡Áø ¾Ë°í¸®ÁòÀÌ Á¸ÀçÇÏÁö¸¸, Àú°¡ÇüÀÇ Ã»¼Ò ·Îº¿¿£ Àû¿ëÇϱ⠾î·Æ´Ù. º» ³í¹®Àº Àú°¡ÇüÀÇ Ã»¼Ò ·Îº¿°ú °°Àº ȯ°æ¿¡¼ È¿À²ÀûÀÎ ¿òÁ÷ÀÓÀ» ±¸ÇöÇϱâ À§ÇØ ¹®¹ýÀû Áøȱâ¹ý ±â¹ÝÀÇ Ã»¼Ò ·Îº¿ÀÇ À̵¿ ÆÐÅÏÀ» °èȹÇÏ´Â ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. À̸¦ À§ÇØ ¹èÄ¿½º-³ª¿ì¸£ Ç¥±â¹ýÀ» »ç¿ëÇÏ¿© À̵¿ ÆÐÅÏ ¹®¹ýÀ» Á¤ÀÇÇÏ°í ÁøÈ¿¬»êÀ» ÅëÇØ ÃÖÀûÈµÈ ÇÁ·Î±×·¥À» »ý¼ºÇÏ¿´´Ù. ÀÌ¿Í ´õºÒ¾î ÇÁ·Î±×·¥ »ý¼º °úÁ¤¿¡¼ ȹµæÇÑ ¹®¹ý ¿ä¼Ò °£ Á¶°ÇºÎ È®·ü Á¤º¸¸¦ È°¿ëÇÏ¿´´Ù. Á¦¾È ¾Ë°í¸®ÁòÀÇ ¼º´É °ËÁõÀ» À§ÇØ Ã»¼Ò ·Îº¿ ½Ã¹Ä·¹À̼ÇÀ» È°¿ëÇÏ¿© ±âÁ¸ ¾Ë°í¸®Áò°ú ¼º´ÉÀ» ºñ±³ÇÏ¿´À¸¸ç ½ÇÇè °á°ú¸¦ ÅëÇØ º» ³í¹®¿¡¼ Á¦¾ÈÇÑ ±â¹ýÀÇ È¿À²¼ºÀ» È®ÀÎÇÏ¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
The cleaning robot is popularly used as a home appliance. The state-of-the-art cleaning robot can clean more efficiently by using information gathered from its sensor, which is difficult for low-price cleaning robots due to limitation in this aspect. In this paper, we suggested a method for the moving pattern of cleaning robot based on grammatical evolution. Optimized program is generated by using moving pattern grammar, which is defined by Backus-Naur form. In addition, conditional probability is used between each of the grammar elements during the program creation process. The proposed method is evaluated by robot simulation in order to verify its performance and further compare it with existing algorithms. The experiment results showed that the proposed method is better than the compared algorithms.
|
Å°¿öµå(Keyword) |
¹®¹ýÀû Áøȱâ¹ý
Ä¿¹ö¸®Áö ¾Ë°í¸®Áò
ÁøÈ ¿¬»ê
¹®¸Æ-ÀÚÀ¯ ¹®¹ý
À̵¿ ÆÐÅÏ
Á¶°ÇºÎ È®·ü
grammatical evolution
coverage algorithm
evolutionary computation
context-free grammar
moving pattern
conditional probability
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|